Bipartite Graphs and Coverings
نویسندگان
چکیده
In many real world applications, data are organized by coverings, not partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to real world application. The covering is one of core concepts in covering-based rough sets, and it is urgent to connect coverings with other new theories with better applicability. This paper establishes the relationship between coverings and bipartite graphs. Through a covering and its index set, a covering induces some isomorphic bipartite graphs. Conversely, a bipartite graph induces a covering of the set of vertices. Moreover, the relationship between these two inductions is studied. Results show that they are converse.
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملBipartite covering graphs
In this paper we study when a bipartite graph is a covering of a non-bipartite graph. We give a characterization of all coverings in terms of factoring the covering map through the canonical double covering. We also consider regular bipartite coverings described in terms of voltage assignments. We give an algebraic characterization of such coverings involving the subgroup generated by voltages ...
متن کاملOne-sided coverings of colored complete bipartite graphs
Assume that the edges of a complete bipartite graph K(A,B) are colored with r colors. In this paper we study coverings of B by vertex disjoint monochromatic cycles, connected matchings, and connected subgraphs. These problems occur in several applications.
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملBipartite Coverings and the Chromatic Number
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliques, that cover the edges of G. We prove the following two results: • If the bipartite graphs form a partition of the edges of G, then their number is at least 2 √ log2 . This is the first improvement of the easy lower bound of log2 k, while the Alon-Saks-Seymour conjecture states that this can be...
متن کامل